home *** CD-ROM | disk | FTP | other *** search

---

/ ftp.ee.pdx.edu / 2014.02.ftp.ee.pdx.edu.tar / ftp.ee.pdx.edu / pub / users / Harry / TheoryOfComp / slides / chapter5 / slide 13.jpeg

< prev

next >

Joint Photographic Experts Group Image  |  2012-11-17  |  184KB  |  850x1100  |  16-bit (20,914 colors)

Labels: bulletin board | daybook | paper | reckoner
OCR: THEOREM THE LANGUAGE M. and Mr are Turing Tm M, Mach ines and ('w)7 L (Mz) UNDECIDABLE PLAIN ENGLISM iven two Pro gra mS can not compnre them Je ho L same "Any corred alg gorithm compa R the Aenct onality two Dro grams will some Himes ha/t Camoare whether thing corret algorithm compare onalits times

---